0.07/0.10 % Problem : Vampire---4.8_26985 : TPTP v0.0.0. Released v0.0.0. 0.07/0.11 % Command : run_E %s %d THM 0.08/0.30 % Computer : n029.cluster.edu 0.08/0.30 % Model : x86_64 x86_64 0.08/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.08/0.30 % Memory : 8042.1875MB 0.08/0.30 % OS : Linux 3.10.0-693.el7.x86_64 0.08/0.30 % CPULimit : 1440 0.08/0.30 % WCLimit : 180 0.08/0.30 % DateTime : Mon Jul 3 13:06:27 EDT 2023 0.08/0.30 % CPUTime : 0.13/0.40 Running higher-order theorem provingRunning: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=180 /export/starexec/sandbox/tmp/tmp.2chlJV5Zeq/Vampire---4.8_26985 0.13/0.40 # Version: 3.1pre001-ho 41.39/5.62 # Preprocessing class: HSSSSMSSSSSNHHA. 41.39/5.62 # Scheduled 5 strats onto 8 cores with 180 seconds (1440 total) 41.39/5.62 # Starting sh2lt with 720s (4) cores 41.39/5.62 # Starting new_ho_10_unif with 180s (1) cores 41.39/5.62 # Starting full_lambda_6 with 180s (1) cores 41.39/5.62 # Starting post_as_ho1 with 180s (1) cores 41.39/5.62 # Starting ehoh_best3_rw with 180s (1) cores 41.39/5.62 # ehoh_best3_rw with pid 27168 completed with status 0 41.39/5.62 # Result found by ehoh_best3_rw 41.39/5.62 # Preprocessing class: HSSSSMSSSSSNHHA. 41.39/5.62 # Scheduled 5 strats onto 8 cores with 180 seconds (1440 total) 41.39/5.62 # Starting sh2lt with 720s (4) cores 41.39/5.62 # Starting new_ho_10_unif with 180s (1) cores 41.39/5.62 # Starting full_lambda_6 with 180s (1) cores 41.39/5.62 # Starting post_as_ho1 with 180s (1) cores 41.39/5.62 # Starting ehoh_best3_rw with 180s (1) cores 41.39/5.62 # SinE strategy is gf120_gu_RUU_F100_L01000 41.39/5.62 # Search class: HGHNF-FFSF22-SHHFFSBN 41.39/5.62 # Scheduled 6 strats onto 1 cores with 180 seconds (180 total) 41.39/5.62 # Starting new_ho_10_unif with 54s (1) cores 41.39/5.62 # new_ho_10_unif with pid 27176 completed with status 0 41.39/5.62 # Result found by new_ho_10_unif 41.39/5.62 # Preprocessing class: HSSSSMSSSSSNHHA. 41.39/5.62 # Scheduled 5 strats onto 8 cores with 180 seconds (1440 total) 41.39/5.62 # Starting sh2lt with 720s (4) cores 41.39/5.62 # Starting new_ho_10_unif with 180s (1) cores 41.39/5.62 # Starting full_lambda_6 with 180s (1) cores 41.39/5.62 # Starting post_as_ho1 with 180s (1) cores 41.39/5.62 # Starting ehoh_best3_rw with 180s (1) cores 41.39/5.62 # SinE strategy is gf120_gu_RUU_F100_L01000 41.39/5.62 # Search class: HGHNF-FFSF22-SHHFFSBN 41.39/5.62 # Scheduled 6 strats onto 1 cores with 180 seconds (180 total) 41.39/5.62 # Starting new_ho_10_unif with 54s (1) cores 41.39/5.62 # Preprocessing time : 0.001 s 41.39/5.62 # Presaturation interreduction done 41.39/5.62 41.39/5.62 # Proof found! 41.39/5.62 # SZS status Theorem 41.39/5.62 # SZS output start CNFRefutation 41.39/5.62 thf(decl_22, type, cLQ: a > a > $o). 41.39/5.62 thf(decl_23, type, esk1_0: (a > $o) > a). 41.39/5.62 thf(decl_24, type, esk2_2: (a > $o) > a > a). 41.39/5.62 thf(decl_25, type, esk3_0: a > a). 41.39/5.62 thf(cTHM145L1_pme, conjecture, ![X1:(a > $o) > a]:(((![X2:a > $o]:((![X3:a]:((![X4:a]:(((X2 @ X4)=>(cLQ @ X4 @ X3)))=>(cLQ @ (X1 @ X2) @ X3)))&![X5:a]:(((X2 @ X5)=>(cLQ @ X5 @ (X1 @ X2))))))&![X6:a, X7:a, X5:a]:((((cLQ @ X7 @ X5)&(cLQ @ X6 @ X7))=>(cLQ @ X6 @ X5))))=>![X8:a > a]:((?[X9:a]:(((cLQ @ (X8 @ X9) @ X9)&(cLQ @ X9 @ (X8 @ X9))))<=![X6:a, X7:a]:(((cLQ @ X6 @ X7)=>(cLQ @ (X8 @ X6) @ (X8 @ X7)))))))), file('/export/starexec/sandbox/tmp/tmp.2chlJV5Zeq/Vampire---4.8_26985', cTHM145L1_pme)). 41.39/5.62 thf(c_0_1, negated_conjecture, ~(![X1:(a > $o) > a]:(((![X2:a > $o]:((![X3:a]:((![X4:a]:(((X2 @ X4)=>(cLQ @ X4 @ X3)))=>(cLQ @ (X1 @ X2) @ X3)))&![X5:a]:(((X2 @ X5)=>(cLQ @ X5 @ (X1 @ X2))))))&![X6:a, X7:a, X5:a]:((((cLQ @ X7 @ X5)&(cLQ @ X6 @ X7))=>(cLQ @ X6 @ X5))))=>![X8:a > a]:((![X6:a, X7:a]:(((cLQ @ X6 @ X7)=>(cLQ @ (X8 @ X6) @ (X8 @ X7))))=>?[X9:a]:(((cLQ @ (X8 @ X9) @ X9)&(cLQ @ X9 @ (X8 @ X9))))))))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cTHM145L1_pme])])). 41.39/5.62 thf(c_0_2, negated_conjecture, ![X23:a > $o, X24:a, X26:a, X27:a, X28:a, X29:a, X31:a, X32:a, X33:a]:(((((((X23 @ (esk2_2 @ X23 @ X24))|(cLQ @ (esk1_0 @ X23) @ X24))&(~(cLQ @ (esk2_2 @ X23 @ X24) @ X24)|(cLQ @ (esk1_0 @ X23) @ X24)))&(~(X23 @ X26)|(cLQ @ X26 @ (esk1_0 @ X23))))&(~(cLQ @ X28 @ X29)|~(cLQ @ X27 @ X28)|(cLQ @ X27 @ X29)))&((~(cLQ @ X31 @ X32)|(cLQ @ (esk3_0 @ X31) @ (esk3_0 @ X32)))&(~(cLQ @ (esk3_0 @ X33) @ X33)|~(cLQ @ X33 @ (esk3_0 @ X33)))))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])])). 41.39/5.62 thf(c_0_3, negated_conjecture, ![X5:a, X4:a, X3:a]:(((cLQ @ X5 @ X4)|~((cLQ @ X3 @ X4))|~((cLQ @ X5 @ X3)))), inference(split_conjunct,[status(thm)],[c_0_2])). 41.39/5.62 thf(c_0_4, negated_conjecture, ![X2:a > $o, X3:a]:(((X2 @ (esk2_2 @ X2 @ X3))|(cLQ @ (esk1_0 @ X2) @ X3))), inference(split_conjunct,[status(thm)],[c_0_2])). 41.39/5.62 thf(c_0_5, negated_conjecture, ![X3:a, X18:a > a, X8:a > a, X4:a]:(((cLQ @ (X8 @ (esk2_2 @ (^[Z0/* 3 */:a]:((cLQ @ (X8 @ Z0) @ (X18 @ Z0)))) @ X3)) @ X4)|(cLQ @ (esk1_0 @ (^[Z0/* 3 */:a]:((cLQ @ (X8 @ Z0) @ (X18 @ Z0))))) @ X3)|~((cLQ @ (X18 @ (esk2_2 @ (^[Z0/* 3 */:a]:((cLQ @ (X8 @ Z0) @ (X18 @ Z0)))) @ X3)) @ X4)))), inference(spm,[status(thm)],[c_0_3, c_0_4])). 41.39/5.62 thf(c_0_6, negated_conjecture, ![X3:a, X4:a]:(((cLQ @ (esk3_0 @ X3) @ (esk3_0 @ X4))|~((cLQ @ X3 @ X4)))), inference(split_conjunct,[status(thm)],[c_0_2])). 41.39/5.62 thf(c_0_7, negated_conjecture, ![X2:a > $o, X3:a]:(((cLQ @ X3 @ (esk1_0 @ X2))|~((X2 @ X3)))), inference(split_conjunct,[status(thm)],[c_0_2])). 41.39/5.62 thf(c_0_8, negated_conjecture, ![X3:a, X18:a > a, X8:a > a, X4:a]:(((cLQ @ (X8 @ (esk2_2 @ (^[Z0/* 3 */:a]:((cLQ @ (X8 @ Z0) @ (esk3_0 @ (X18 @ Z0))))) @ X3)) @ (esk3_0 @ X4))|(cLQ @ (esk1_0 @ (^[Z0/* 3 */:a]:((cLQ @ (X8 @ Z0) @ (esk3_0 @ (X18 @ Z0)))))) @ X3)|~((cLQ @ (X18 @ (esk2_2 @ (^[Z0/* 3 */:a]:((cLQ @ (X8 @ Z0) @ (esk3_0 @ (X18 @ Z0))))) @ X3)) @ X4)))), inference(spm,[status(thm)],[c_0_5, c_0_6])). 41.39/5.62 thf(c_0_9, negated_conjecture, ![X40:a > a > $o, X3:a]:(((cLQ @ (esk2_2 @ (^[Z0/* 3 */:a]:((X40 @ Z0 @ Z0))) @ X3) @ (esk1_0 @ (^[Z0/* 3 */:a]:((X40 @ Z0 @ Z0)))))|(cLQ @ (esk1_0 @ (^[Z0/* 3 */:a]:((X40 @ Z0 @ Z0)))) @ X3))), inference(spm,[status(thm)],[c_0_7, c_0_4])). 41.39/5.62 thf(c_0_10, negated_conjecture, ![X2:a > $o, X3:a]:(((cLQ @ (esk1_0 @ X2) @ X3)|~((cLQ @ (esk2_2 @ X2 @ X3) @ X3)))), inference(split_conjunct,[status(thm)],[c_0_2])). 41.39/5.62 thf(c_0_11, negated_conjecture, ![X3:a]:(((cLQ @ (esk2_2 @ (^[Z0/* 3 */:a]:((cLQ @ Z0 @ (esk3_0 @ Z0)))) @ X3) @ (esk3_0 @ (esk1_0 @ (^[Z0/* 3 */:a]:((cLQ @ Z0 @ (esk3_0 @ Z0)))))))|(cLQ @ (esk1_0 @ (^[Z0/* 3 */:a]:((cLQ @ Z0 @ (esk3_0 @ Z0))))) @ X3))), inference(spm,[status(thm)],[c_0_8, c_0_9])). 41.39/5.62 thf(c_0_12, negated_conjecture, ![X8:a > a, X3:a]:(((cLQ @ (esk3_0 @ X3) @ (esk1_0 @ (^[Z0/* 3 */:a]:((cLQ @ Z0 @ (esk3_0 @ (X8 @ Z0)))))))|~((cLQ @ X3 @ (X8 @ (esk3_0 @ X3)))))), inference(spm,[status(thm)],[c_0_7, c_0_6])). 41.39/5.62 thf(c_0_13, negated_conjecture, (cLQ @ (esk1_0 @ (^[Z0/* 3 */:a]:((cLQ @ Z0 @ (esk3_0 @ Z0))))) @ (esk3_0 @ (esk1_0 @ (^[Z0/* 3 */:a]:((cLQ @ Z0 @ (esk3_0 @ Z0))))))), inference(spm,[status(thm)],[c_0_10, c_0_11])). 41.39/5.62 thf(c_0_14, negated_conjecture, ![X3:a]:((~((cLQ @ (esk3_0 @ X3) @ X3))|~((cLQ @ X3 @ (esk3_0 @ X3))))), inference(split_conjunct,[status(thm)],[c_0_2])). 41.39/5.62 thf(c_0_15, negated_conjecture, (cLQ @ (esk3_0 @ (esk1_0 @ (^[Z0/* 3 */:a]:((cLQ @ Z0 @ (esk3_0 @ Z0)))))) @ (esk1_0 @ (^[Z0/* 3 */:a]:((cLQ @ Z0 @ (esk3_0 @ Z0)))))), inference(spm,[status(thm)],[c_0_12, c_0_13])). 41.39/5.62 thf(c_0_16, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14, c_0_15]), c_0_13])]), ['proof']). 41.39/5.62 # SZS output end CNFRefutation 41.39/5.62 # Parsed axioms : 3 41.39/5.62 # Removed by relevancy pruning/SinE : 2 41.39/5.62 # Initial clauses : 6 41.39/5.62 # Removed in clause preprocessing : 0 41.39/5.62 # Initial clauses in saturation : 6 41.39/5.62 # Processed clauses : 878 41.39/5.62 # ...of these trivial : 170 41.39/5.62 # ...subsumed : 209 41.39/5.62 # ...remaining for further processing : 499 41.39/5.62 # Other redundant clauses eliminated : 0 41.39/5.62 # Clauses deleted for lack of memory : 0 41.39/5.62 # Backward-subsumed : 41 41.39/5.62 # Backward-rewritten : 58 41.39/5.62 # Generated clauses : 50845 41.39/5.62 # ...of the previous two non-redundant : 46357 41.39/5.62 # ...aggressively subsumed : 0 41.39/5.62 # Contextual simplify-reflections : 1 41.39/5.62 # Paramodulations : 50682 41.39/5.62 # Factorizations : 162 41.39/5.62 # NegExts : 0 41.39/5.62 # Equation resolutions : 1 41.39/5.62 # Total rewrite steps : 4949 41.39/5.62 # Propositional unsat checks : 0 41.39/5.62 # Propositional check models : 0 41.39/5.62 # Propositional check unsatisfiable : 0 41.39/5.62 # Propositional clauses : 0 41.39/5.62 # Propositional clauses after purity: 0 41.39/5.62 # Propositional unsat core size : 0 41.39/5.62 # Propositional preprocessing time : 0.000 41.39/5.62 # Propositional encoding time : 0.000 41.39/5.62 # Propositional solver time : 0.000 41.39/5.62 # Success case prop preproc time : 0.000 41.39/5.62 # Success case prop encoding time : 0.000 41.39/5.62 # Success case prop solver time : 0.000 41.39/5.62 # Current number of processed clauses : 394 41.39/5.62 # Positive orientable unit clauses : 73 41.39/5.62 # Positive unorientable unit clauses: 0 41.39/5.62 # Negative unit clauses : 14 41.39/5.62 # Non-unit-clauses : 307 41.39/5.62 # Current number of unprocessed clauses: 45044 41.39/5.62 # ...number of literals in the above : 140874 41.39/5.62 # Current number of archived formulas : 0 41.39/5.62 # Current number of archived clauses : 105 41.39/5.62 # Clause-clause subsumption calls (NU) : 12683 41.39/5.62 # Rec. Clause-clause subsumption calls : 10842 41.39/5.62 # Non-unit clause-clause subsumptions : 239 41.39/5.62 # Unit Clause-clause subsumption calls : 2109 41.39/5.62 # Rewrite failures with RHS unbound : 0 41.39/5.62 # BW rewrite match attempts : 1970 41.39/5.62 # BW rewrite match successes : 62 41.39/5.62 # Condensation attempts : 878 41.39/5.62 # Condensation successes : 4 41.39/5.62 # Termbank termtop insertions : 11940280 41.39/5.62 41.39/5.62 # ------------------------------------------------- 41.39/5.62 # User time : 5.044 s 41.39/5.62 # System time : 0.158 s 41.39/5.62 # Total time : 5.201 s 41.39/5.62 # Maximum resident set size: 1884 pages 42.10/5.71 42.10/5.71 # ------------------------------------------------- 42.10/5.71 # User time : 5.046 s 42.10/5.71 # System time : 0.158 s 42.10/5.71 # Total time : 5.204 s 42.10/5.71 # Maximum resident set size: 1728 pages 42.10/5.71 % E---3.1 exiting 42.10/5.71 EOF